Analytic Techniques for Periodic Trellis Codes Richard

نویسندگان

  • Richard D. Wesel
  • Xueting Liu
چکیده

This paper presents analytical techniques for trellis codes on AWGN channels with periodic fading. The paper begins with an asymptotically tight union bound on the bit error rate of a trellis code on such a channel and a procedure for eeciently computing the required transfer function for any trellis code, including those that do not satisfy regularity properties that simplify the task. Periodic erasures can cause an encoder that is non-catastrophic for the regular AWGN channel to display catastrophic behavior. Two techniques identify erasure patterns that will cause this behavior. One technique applies the traditional catastrophic test to a strictly equivalent multiple trellis code after removing columns corresponding to erased symbols. The second technique eeciently searches for zero distance loops in the state diagram.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Serially concatenated trellis coded modulation for the compound periodic erasures channel

This paper extends the near-capacity performance of serially-concatenated convolutional codes under AWGN to periodically time-varying channels. In particular, we propose serially-concatenated trellis-coded modulations (SCTCMs) that perform consistently close to channel capacity under periodic erasures as well as under AWGN, without sacrificing AWGN channel performance. The proposed 0.5 bits/sym...

متن کامل

The weighted coordinates bound and trellis complexity of block codes and periodic packings

Weighted entropy profiles and a new bound, the weighted coordinates bound, on the state complexity profile of block codes are presented. These profiles and bound generalize the notion of dimension/length profile (DLP) and entropy/length profile (ELP) to block codes whose symbols are not drawn from a common alphabet set, and in particular, group codes. Likewise, the new bound may improve upon th...

متن کامل

Correction to "Universal trellis codes for diagonally layered space-time systems"

Foschini’s diagonally layered space-time transmission system known as D-BLAST is an architecture designed for a Rayleigh fading environment using multiple element antenna arrays at both the transmit and receive sites to achieve very high spectral efficiencies. In this paper, we propose a simple coding technique for D-BLAST that uses a single trellis code with finite-traceback Viterbi decoding. ...

متن کامل

Convolutionally Interleaved PSK and DPSK Trellis Codes for Shadowed, Fast Fading Mobile Satellite Communication Channels

Using a model from the literature, the performance of convolutionally interleaved phase shift keying (PSK) and differential phase shift keying (DPSK) trellis codes for digital speech transmission over a shadowed mobile satellite communication channels is determined via digital computer simulation. First the characteristics of fading channels are examined and analyzed in terms of the probability...

متن کامل

Further error event diagram reduction using algorithmic techniques

Biglieri showed that a diagram with N states can be used to compute the generating function for any trellis code with N states. Rouanne & Costello and Zehavi & Wolf showed that for quasi-regular trellis codes, an N -state diagram produces the correct generating function. Schlegel showed that application of a standard FSM (finite-state-machine) minimization algorithm reduces quasi-regular trelli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998